METHOD OF ADHESION TO A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECTRON

专利摘要:
The invention relates to a method of adhesion to a cluster comprising a plurality of communicating electronic devices (10, 10i). It also relates to any electronic device implementing said adhesion process and any system comprising such a device. The latter advantageously comprises a processing unit (11), a data memory (12) comprising the value of an identifier (ID) dedicated to the device and a record (RH) to include the current value (IDHc) of an identifier. a device acting as a cluster head and a data item (CH) representing the capacity of the latter to assume a particular service (S). The device further comprises a program memory (14) comprising instructions of a program (P) whose execution or interpretation by the processing unit causes the implementation of the adhesion process.
公开号:FR3023662A1
申请号:FR1456660
申请日:2014-07-10
公开日:2016-01-15
发明作者:Pascal Daragon；Natale Guzzo；Nathalie Mitton；Arulnambi Nandagoban
申请人:INST NAT DE RECH EN INF ET AUTOMATIQUE；Traxens；
IPC主号:

专利说明:

[0001] Method for adhesion to a cluster of electronic devices communicating via a wireless network, electronic device implementing said method, and associated systems The invention relates to a method of adhesion to a cluster of communicating electronic devices, said method being implemented. implemented by a processing unit of one of said electronic devices communicating with peers through a wireless communication network. The invention further relates to a system comprising a plurality of devices implementing such a method of adhesion.
[0002] As an example of a preferred but nonlimiting application, the invention will be described by way of an example of application in connection with the collection of quantities, such as, for example, temperature, humidity, light, vibration, shock , etc., in connection with the internal and / or external environments of containers or containers of goods or merchandise. According to said application example, said containers are agglomerated, stacked on a storage area or roaming on a transport platform such as a container ship, a freight train or any other suitable transport platform. Each container cooperates with one of said communicating devices. The latter are responsible for collecting and routing said quantities through service messages to even devices acting as a "cluster head" whose mission is also to implement a specific service. Such a service may, for example, consist in aggregating data collected by the communicating devices and in transmitting said data after their aggregation to a remote entity by means of a long-range or long-distance link of the satellite link or radiotelephone link type. The invention can not, however, be limited to this single application example. More generally, a "cluster head" device will be responsible for implementing a given service in connection with data collected and forwarded by its peers, said given service being able to concern a supervision or an alarm management, in place and place. in addition to a connection with a remote entity.
[0003] Many typologies or configurations of networks of communicating objects exist. Figure 1 thus schematically shows two networks R1 and R2 of wireless communication. Whatever the network operated, each communicating device, which is also called and generally "node" within such a network, implements a communication method allowing it to exchange data messages and / or service with a third or peer node. Thus, the network R1 situates thirty communicating electronic devices respectively referenced in Figure 1: al to a8, bl to b8, cl to c8, dl to d8 and el to e8. For its part, the network R2 situates twenty-five communicating electronic devices, respectively referenced in Figure 1: fi to f5, gl to g5, hl to h5, it to i5 and jl to j5. That we operate a simple-hop network (or "single-hop network" in English terminology), such as, for example, the network R2 described in connection with Figure 1, or multisauts (or "Multi-hop network" according to an English terminology) such as, for example, the network R1 described in connection with Figure 1, a first node that we will call "source", can prepare a service message, represented in FIG. 1 by a double arrow, comprising data related to, by way of nonlimiting example, a quantity measured by a sensor cooperating with said first node, destined for a second "destination" node. According to a simple-hop network, the communication between the first and second nodes is direct. On the other hand, according to a multislot network, such communication may be indirect. Thus, a message addressed from a "source" node may be relayed by one or more "third or intermediate" nodes, whose respective roles are to relay said message from the "source" node so that it is ultimately routed to and received by the "recipient" node. In this case, the nodes constitute clusters or clusters, in English terminology, such as, for example, the clusters Cl and C2 represented by a line strapping dotted by FIG. 1. The path along which a Service message from a "source" node to a second "recipient" node via one or more "relayer" nodes is generally referred to as "route". Thus, according to FIG. 1, a message sent from node a4 to node d2 will be relayed successively by intermediate nodes b4 and c3. Communication within single-hop or multiswitch communication networks is generally done by radio. The communication is generally of short range, that is to say of the order of a few meters to a few tens of meters, so that, step by step, the service messages are transmitted between the different nodes. When data is supposed to be routed to a server or more generally to a remote entity, a second mode of communication is implemented, for example, by GSM ("Global System for Mobile Communications" in a terminology Anglo-Saxon) or GPRS ("General Racket Radio Service" according to an Anglo-Saxon terminology) or even by a satellite link. The exchanges between nodes, treatments or calculations implemented by the latter based on data exchanged, as well as the eventual and remote routing of data collected within a network or a cluster of communicating devices, are as many d actions consuming electricity.
[0004] As indicated by a preferred example in FIG. 2, a node generally consists mainly of an electronic device 10 comprising a processing unit 11, for example in the form of a microcontroller cooperating with a data memory 12. optionally a program memory 14, said memories being optionally dissociated. The processing unit 11 cooperates with said memories 12 and 14 by means of internal communication buses. Generally, an electronic device 10 comprises one or more sensors 15 for measuring a physical quantity in relation to the environment of the device 10. Such a sensor can measure the surrounding temperature, a humidity level or the presence / absence of light. . The device 10 further comprises first communication means 13 cooperating with the processing unit 11 and providing a wireless proximity communication with any other electronic device 10i located within communication range. It may further comprise second means of communication 16 of the "long distance" type cooperating with the processing unit 11. These second communication means allow such a device 10 to be able to transmit to a remote entity, for example an RS server. , data through MC messages distributed by an RR network operating, for example, GSM, GPRS or satellite technologies. To function, that is to say for the processing unit 11 to implement a method arising from the interpretation or execution, by said processing unit, of program instructions P stored in the memory 14, the device 10 comprises a source of electrical energy 17, in the form of one or more batteries for example. The ability to communicate or simply to be able to operate from one node is directly related to the remaining and available energy capacity of said node. Some have sought to design networks or communication methods, implemented by nodes within a network or cluster, to preserve the overall electrical power capacity of the network or cluster. Overall, a first approach consists in distributing the energy cost resulting from the exchanges between the nodes on all the said nodes of the network or the cluster. It has also been sought to distribute the energy consumption resulting from the processing operations carried out on data collected, for example long-distance transmission, on most of the nodes, thereby sharing the power consumption over a plurality of nodes. Thus, whether the contactless communication network is in a single-hop or multi-tasking configuration, a node may arbitrarily be designated as a "head-end" or at least as a "cluster head", which we will describe as the "head of the network". Anglo-Saxon term "head". In connection with FIG. 1, a device acting as a "cluster head" is represented by a circle drawn in thick lines. This is the node d2 for the network R1 and the node h3 for the network R2. The nodes d2 and h3 thus act as heads respectively of Cl and C2 clusters. In this way, the energy consumed, in particular for remotely transmitting data collected within a network, is shared over a plurality of nodes. Alternatively, the heads may be randomly designated, or more precisely may randomly self-designate respectively head, provided that the latter 5 have sufficient hardware and / or software to implement a specific service. By way of example, the "LEACH" method, as described in particular by the document titled "An ApplicationSpecific Protocol Architecture for Wireless Microsensors Networks" (W. Heinzelman, A. Chandrakasan, H. Balakrishnan IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 1, No. 4, OCT 2002), allows in a simple-jump network, randomly designate a node to become head. The other nodes belonging to the cluster of said head, nodes that we will call respectively "member" or "member" according to an English terminology, address to the cluster head, so the head, their service messages. In connection with FIG. 1, each member node is represented by a circle drawn in fine lines. Thus, within the network R2, the head h3 communicates directly with the nodes g2 to g4, h2 and h3 as well as with the nodes i2 to i4. The head collects said data transmitted from different member nodes, processes, aggregates or even consolidates them, and triggers, for example, a long-range transmission to a remote entity, such as an RS server described in connection with the According to this known technique, once a node has assumed the role of head, such a node can not perform such a role again before the expiration of a given period. A new member node is then randomly designated head, thus ensuring continuity of service. So that a node, which we will call "free" or "loose" according to an Anglo-Saxon terminology, 35 represented by a circle drawn in double line in connection with Figure 1, can adhere to a head and thus constitute a new cluster or join an existing cluster, a loose node located within radio range of a node promoted head, is arranged to receive an enrollment message MH emanating from said head, generally issued in the form of an undifferentiated transmission (also known as "broadcast") of MH enrollment messages to any node within radio range of the head. FIG. 1, allows, through the network R2, to describe the resultant of a transmission of an MH message transmitted from the node h3, designated to act as a head, MH message transmitted in a short-range broadcast mode to nodes located within communication range, in this case, the nodes g2 to g4, h2 and h4, as well as the nodes i2 to i4, initially loose nodes, like the other nodes, such as, non-exhaustively, the nodes fi to f5, represented by circles in double lines in FIG. 1. Upon receipt of such an enrollment message MH, a loose node, for example the node h4, updates its data memory, said memory cooperating with its processing unit to record the coordinates or the identifier of the head, the identifier of the node h3 in connection with Figure 1. The device h4 previously free or loose node becomes a member of the cluster C2, a node member, represented by a circle in fine line. The device h3, acting as a cluster head or head, becomes the recipient of any MS service message comprising data collected by the new h4 device member C2 cluster like other devices members of said cluster, or g2, g3, g4, i2, i3 and i4. Thus, said nodes g2 to g4, h2 and h4, as well as nodes i2 to i4, previously loose nodes, become member nodes, appearing in circles drawn in single line, in Figure 1. The transmission of the message MH by the node h3 is limited in scope. Also nodes, located out of reach, do not receive the message MH as an intelligible message, or do not receive it at all. The network R2 is of single-hop type, the nodes being out of reach of h3, such that the nodes fi to f5, gl, g5, h1, h5, il, i5 or again the nodes j1 to j5 remain loose nodes, represented by circles drawn in double lines. Cluster C2 only includes node h3, acting as a head, and member nodes (that is, having accepted enlistment of h3) or members.
[0005] A transposition of the LEACH teaching in the context of a multisize network, such as the network R1 described in connection with FIG. 1, could suggest that the nodes, becoming members of a cluster comprising a node acting as a head of cluster, record, within their respective data memories, the route, that is to say, the identifier of the node acting as head and at least the identifier of the node relayed the enrollment message of said head or, alternatively, the identifiers of the intermediate nodes separating it from said head. Thus, by way of example, the node c2 would record the identifier of the head d2, having received directly an enrollment message MH from said node d2. The node b2 would record, besides the identifier of the node d2, the latter of the node c2 relayed the enrollment message MH of d2 in favor of the node b2. Such an approach allows in theory, or at least according to a perfect mode of application, to preserve the global energy resources of a communication network comprising a plurality of communicating nodes. In practice or in reality, and in particular according to fields of application or operation of such a communication network in connection with the transport of containers cooperating with communicating electronic devices, such a solution remains irrelevant, at least effective.
[0006] As an example of a preferred but nonlimiting application, let us describe the operation of a wireless communication network whose nodes record, collect and transmit measurements in connection with a plurality of containers, such as containers of goods. or goods. Imagine that each container is associated with a communicating electronic device implementing a communication method such as LEACH. According to this hypothesis, each communicating electronic device associated with a container acts as a node within the wireless network, such as the network R2 described in connection with FIG. 1. Imagine that the mode of communication between nodes is done by way of radio. In addition to the fact that a LEACH-type communication method imposes a single-hop approach, thus imposing that each node may be able to communicate directly with a head, the relative arrangement of the containers, for example on a ship, on a storage area or on any road or rail transport platform, creates an application context such that a designated node head may not be able to fulfill its mission, for example by transmitting aggregated data to a unit remote, simply because of its positioning in a stack of containers for example. Indeed, there are many obstacles constituted by a transport platform and / or a storage space, due to partitioning or partial confinement imposed by the container reception structure or by the interactions generated mutually by the containers themselves. same, whose stacking can lead to degradation, or even loss of capacity to transmit data by long distance from a head. The risk of a loss of data, slow data routing, but also unnecessary and irrelevant energy expenditure to "animate" a cluster whose head would not be able to effectively perform its function or service, is very great. This risk is even more so in the case where the random election of consecutive heads would result in a "choice" not very successful. Transposing such teaching to a multisheet network can not be more relevant. Indeed, although allowing to extend the size of a cluster, that is to say the number of nodes members of said cluster, independent random election of the relative position of a node with regard to its peers is likely to aggravate energy expenditure to try to form clusters, ultimately not communicating, as heads elections.
[0007] The invention makes it possible to meet the great majority of the disadvantages raised by the known solutions. By constituting a wireless communication network, particularly innovative and powerful, regardless of the relative arrangement of the nodes and regardless of the application or operating framework of said network, whether it is a single-hop or multisault type, the invention makes it possible to optimize the global capacity of the network to provide a service determined from data collected by the different nodes. The main originality of the process of joining a cluster of communicating devices lies in how heads are elected, if and only if the latter are in real capacity to assume their role of head of cluster, for example to issue data in a long distance communication mode. Each node implementing a method according to the invention can decide to act as head, from the moment said node knows that it is in a position to effectively perform its role. Furthermore, any loose knot may decide to adhere or not to a cluster of nodes, said cluster comprising said head, preferably self-designated. Among the many advantages provided by the invention, we can mention that it makes it possible: to appropriately share the energy expenditure on the nodes of the network, thus prolonging the capacity to render a service of said network in an unequaled manner compared to in the state of the art; to design a node network that is automatically adaptable and functional as changes in relative positions between the nodes or changes in the operating conditions of said nodes, for example during the handling, storage or transport of containers associated with each an electronic device according to the invention; 20 to give priority to the robustness of the service (for example long-distance data transmission) by conferring on each node in accordance with the invention the opportunity to determine its role within the network and to refer to each instant to the best head according to the service in question, while minimizing conflicts or changing clusters in concomitant elections of a plurality of heads located within radio range of common nodes. For this purpose, the invention relates to a method of adhesion to a cluster comprising a plurality of communicating electronic devices, said method being implemented by a processing unit of one of said communicating electronic devices or a device electronic communicating foreign to said cluster. Said electronic device comprises, in addition to said processing unit, a data memory, first communication means ensuring a wireless proximity communication with any other electronic device located within communication range, said memory and said communication means cooperating with said unit treatment. The data memory includes the value of an identifier dedicated to the communicating electronic device and a record to include the current value of an identifier of a communicating electronic device acting as a cluster head. In order for the device, implementing such a method, to adhere to a cluster comprising a device acting as a cluster head, said method comprises: a step for receiving an enrollment message elaborated and transmitted by a communicating electronic device third party having quality to act as a cluster head, said enrollment message including the identifier of the device transmitting said enrollment message; a step for decoding said enrollment message and for deducing said identifier from said sending device of the enrollment message; a step for updating the recording so that said recording stores, as current value of device identifier acting as a cluster head, the value of the identifier of the device transmitting the decoded enrollment message, said device implementing said method becoming a cluster member. In particular, in order to effectively pool energy expenditure over all the nodes of a particularly robust network, to extend the capacity to render a service by said network, an enrollment message furthermore includes a datum expressing the capacity of said transmitting device. to be able to provide a given service. In addition, the step of an adhesion method according to the invention for decoding such an enrollment message further deduces from said message said data reflecting said capacity. Furthermore, the step of said method for updating the recording further comprises entering in said record the value of the data reflecting the ability of the transmitting device to provide said service.
[0008] For a device implementing such an enrollment method to accept or reject a candidate that has issued an enrollment message, the step of updating the record may only be performed if the data reflecting said enrollment is greater than or equal to a specified minimum threshold of requirement. For a device implementing an adhesion method according to the invention can select a relevant candidate from a plurality of devices that have issued an enrollment message, or even arbitrate a competition between two or more devices designated to act as a cluster heads, an adhesion method according to the invention may comprise a step subsequent to the step of decoding an enrollment message and prior to the step to update the record comprising the current value of the identifier of the device acting as a cluster head. Such a step may consist of: reading from said record the current value of the identifier of the device acting at the head of the cluster; comparing said current value with that of the identifier of the device transmitting the decoded enrollment message. If said identifier values are distinct, the step of updating the record can be advantageously accomplished only if the data reflecting the ability of the sending device of the enrollment message to provide the same service is greater than or equal to the value of the data representing the current capacity of the device acting as a cluster head increased by a determined non-zero constant. In the context of an implementation of the invention in a multiswitch network, an adhesion method according to the invention may comprise a step subsequent to the step of updating the recording, to encode and transmit via the means of communication an enrollment message comprising the identifier of the device registered in the record comprising the current value of the identifier of the device acting as a cluster head, the data reflecting the capacity of said device to be able to provide the service, as well as the identifier of the device implementing said method of adhesion and acting as a relaying group member of the enrollment message. According to this variant, the step of decoding an enrollment message may advantageously consist in deducing from said decoded message the value of the identifier of a device acting as a cluster member and relaying an enrollment message emanating from a device acting as a cluster head. The step of updating the recording may, for its part, consist in inscribing within said recording said identifier of the cluster member device, relay of the enrollment message, the pair of identifiers of the member devices of the cluster. and cluster head thus constituting road information. To contribute to the determined service, a method of adhesion, according to the invention and implemented by a node member of a cluster, may include a step for transmitting a service message to the device acting as a head of cluster for the service in question.
[0009] When a device acting as a cluster head no longer wishes to act as such, it can issue a cluster destruction message. An adhesion process in accordance with the invention may comprise: a step for receiving a cluster destruction message developed and issued by a third party communicating electronic device having prior quality to act as a cluster head, said destruction message; cluster comprising the identifier of the device transmitting said cluster destruction message; a step for decoding said cluster destruction message and for deducing therefrom said identifier of said device transmitting the cluster destruction message; a step for updating the record comprising the current value of an identifier of a device acting as a cluster head to delete said current value or replace it with a predetermined value representing a lack of identifier of device acting as a cluster head, said device implementing said method becoming free, said update of the record being performed only if the value of the identifier deduced from the cluster destruction message is identical to the current value entered in said record.
[0010] An adhesion process according to the invention may allow any device implementing it to self-designate or self-elect node acting as a cluster head. However, in order for such an election to be relevant, whatever the operating conditions of said network, such an adhesion process may comprise: a step for evaluating the capacity of the device, implementing said method, to assume a defined service, said step of estimating one or more operating parameters of said device and producing the data reflecting the ability of said device to provide the specific service; a step for comparing the data representing said capacity with a minimum functional requirement threshold; a step for encoding and transmitting an enrollment message, comprising the identifier of said device as well as the data representing the capacity of said device to be able to provide said determined service, to any communicating device located within communication range, said step n 'being implemented only if the data translating said capacity is greater than or equal to said minimum functional requirement threshold. As mentioned above, a device acting as a cluster head and implementing a method according to the invention can detect that it no longer fulfills the conditions necessary to effectively provide the determined service. It can then, before being in failure of operation, resign from its role of head of cluster, such a resignation leading to the destruction of the cluster of nodes concerned. As such, the step previously mentioned to evaluate the capacity of the device can be iterative. In addition, said method may comprise a step 35 subsequent to the transmission of an enrollment message, for encoding and transmitting a cluster destruction message, said message comprising the identifier of said device, intended for any communicating device located within the communication range, as soon as an occurrence of the step for evaluating the capacity of the device to assume the particular service attests that a parameter among the operating parameters of said device is less than a required functional minimum, attesting an insufficient capacity to be able to provide the service. Whether to self-elect device capable of acting as a cluster head or to put an end to it, the adhesion process makes it possible to compare operating parameters with respect to thresholds or minima. According to the device comprises a source of electrical energy supplying the processing unit, the data memory, the communication means, the invention provides that one of said operating parameters can describe the level of available electrical energy of the source of electrical energy. As a variant or in addition, depending on whether said device comprises second long-distance communication means cooperating with the processing unit, the service consisting of sending data to a remote entity via said long-distance communication means, the invention provides that one of said operating parameters can describe the transmission power of a signal by the long distance communication means. Whatever the variant embodiment of an adhesion process according to the invention, and in order to adapt a communicating electronic device so that it can implement such a method, the invention provides a computer program comprising a plurality of program instructions which, when: - previously stored in a program memory of an electronic device further comprising a processing unit, first communication means providing wireless proximity communication with any another electronic device located within communication range, a data memory storing the value of an identifier dedicated to the device and a record to include the current value of an identifier of a device acting as a cluster head, said memories and communication means cooperating with said processing unit; - executed or interpreted by said processing unit, causes the implementation of an adhesion process according to the invention.
[0011] According to a third object, the invention furthermore relates to an electronic device comprising a processing unit, a data memory, a program memory, first communication means ensuring wireless proximity communication with any other electronic device located at communication range, said memories and the communication means cooperating with said processing unit, the data memory comprising the value of an identifier dedicated to the device and a record for comprising the current value of an identifier of a device acting in as a cluster head. For a device to be a player of a network according to the invention, the program memory of said device comprises the instructions of a program as discussed above.
[0012] According to a fourth object, the invention relates to a system comprising a plurality of communicating electronic devices according to the invention, that is to say implementing an adhesion process according to said invention. According to a preferred application, such a system may advantageously comprise a plurality of containers of goods, of solid, fluid or liquid goods, said containers cooperating respectively with the communicating electronic devices, the latter each comprising a sensor cooperating with the unit of 10 process for measuring and collecting a quantity in connection with the internal and / or external environments of said containers. Other features and advantages will become more clearly apparent on reading the following description relating to an exemplary embodiment given for information only and not limiting and to the examination of the figures which accompany it, among which: FIG. 1 , already described, illustrates two examples of configurations of a wireless communication network, respectively simple-hop or multisauts; FIG. 2, partially already described, presents the functional architecture of a communicating electronic device according to the prior art and according to the invention when the latter is adapted to implement a method of adhesion to a cluster of devices. communicating with peers via a wireless communication network, said method being in accordance with the invention; FIG. 3 presents a functional description of such an adhesion process according to the invention. A communicating electronic device according to the invention is similar to a known device 10, such as that previously described in connection with FIG.
[0013] As such, a communicating electronic device according to the invention comprises a processing unit 11, consisting of one or more microcontrollers responsible for carrying out processing on data in particular. Said data are advantageously, all or part, recorded on one or more data memories 12, generally electrically erasable and writable. The memory 12 may advantageously comprise a non-erasable section, physically isolated or simply arranged so that access to write or erase is prohibited, or requiring the satisfaction of an authentication procedure. Such an advantageous section of the memory 12, whose access to modification is restricted, makes it possible to record in particular an identifier ID dedicated to the communicating electronic device. Advantageously, but not obligatorily, a device 10 may further include one or more program memories 14 for recording one or more programs P, or more generally one or more sets of program instructions, said program instructions being intelligible. by the processing unit 11 and whose execution or interpretation by said processing unit causes the implementation of a method of data processing or operation of the device 10. The latter also comprises first means of communication 13 providing wireless proximity communication with any other electronic device, such as the device 10i, provided that the latter is within communication range. Through said means 13, the device 10, or more precisely its processing unit 11, can transmit and / or receive messages to or from third devices positioned within communication range. Such messages can be of any kind. According to the invention, we will distinguish different types of messages, among which we can mention, in a non-exhaustive manner, MS data messages in connection with a particular service S, MH enrollment messages, MR cluster destruction messages. .
[0014] Some communicating devices can benefit from the electromagnetic field created by the network, to draw sufficient electrical energy to ensure their operation, if only for a brief period of time. However, to ensure continuous operation and / or implement treatments requiring more energy, a communicating electronic device 10 according to the invention may advantageously include a source of electrical energy 17 clean, including feeding the processing unit 11 or any other element constituting said device that would require it. Such a source 17 generally consists of a battery or a plurality of batteries. Depending on the privileged application context in particular with the container tracking, although this particular context can not limit the field of exploitation of the invention, a communicating electronic device 10 may comprise one or more sensors 15 cooperating with the control unit. 11. Such a sensor can measure one or more quantities related to the internal and / or external environments of said containers and produce data. By way of example, as illustrated in FIG. 2, a sensor can measure the temperature and / or the humidity prevailing within a container, the darkness or the loss of darkness within the enclosure attesting to a unexpected opening of the container or even shocks. If necessary, the sensor or sensors may cooperate with the processing unit of a device via probes or conductive sheets, especially in the case where a device 10 would be affixed against the outer wall of a container while one wishes to supervise, by means of said device 10, the interior environment of said container. Such a device 10 may further comprise a clock allowing it to time stamp the collected measurements, said clock not being represented in FIG. 2.
[0015] Depending on the service or services that one wishes to operate using communicating electronic devices according to the invention, the latter may comprise additional and optional means. As a preferred example, a service may consist of: collecting data from the nodes of a network of communicating electronic devices according to the invention, for example in relation to quantities measured by said nodes; aggregating said collected data with a plurality of nodes, and then constructing MC messages encoding consolidated service data to a remote entity, such as an RS server.
[0016] To transmit such messages MC, a device 10 advantageously comprises second long-distance communication means 16 cooperating with the processing unit 11. Such communication can be carried out via an RR network, by GPRS channels, satellite or even any other path adapted communication. The various internal components of the electronic device cooperate with the processing unit 11, advantageously by wired buses or by couplings. The device 10 comprises a housing housing said components, said housing advantageously comprising fixing means for affixing the device 10 to a support which it is desired to follow, in this case a container according to the preferred application example.
[0017] To implement the invention, it is required to act on the operation of the processing unit, more precisely on the communication method implemented by said processing unit. Such a method will be described in connection with Figure 3 later. A preferred mode of adaptation consists in providing a program or more generally program instructions mutually arranged to implement said method during the execution or interpretation of said program instructions by the processing unit. Advantageously, said program P is loaded into the program memory 15 during assembly of said device or, by downloading said program within the memory 15 after said assembly phase of the device. The invention lies mainly in the implementation of a simple-hop network or advantageously multisauts, for which each node consists of a communicating electronic device such as the device 10 previously described. A node of such a network is adapted to implement a method of adhesion to a cluster of devices, such as the method P100 described below in connection with FIG. 3. For this implementation, the invention provides that the data memory 12 comprises, besides the identifier ID dedicated to the communicating electronic device, an RH record provided to include the current value IDHc of an identifier of a communicating electronic device acting as a cluster head, such as the nodes d2 or h3 according to Figure 1. According to the invention, when a device chooses to adhere to a cluster whose one node acts as a cluster head, this membership is exclusive. In other words, a node can not be a member of distinct clusters, that is to say each having separate heads nodes, for the same service. According to the invention, as we will see later, a node adhering to a cluster chooses the best head for said service. In contrast, the invention provides that a node can be attached to a plurality of heads, if said heads are assigned to the implementation of separate services: for example a head for long distance data transmission (service Si) and a second head for the implementation of an alarm management service (service Sj) on a site.
[0018] As such, like the LEACH solution, previously presented, the invention makes it possible to create clusters of communicating electronic devices, such as clusters C1 and C2 of the networks R1 and R2 described in connection with FIG. clusters comprising a device acting as a cluster head or head, such as the nodes d2 or h3 described in connection with Figure 1, the other devices acting as members or members of said cluster, such as, but not limited to , the nodes c2 or i3 described in connection with FIG. 1. The role of a member consists mainly of collecting information, such as, for example, measurements of environmental magnitudes, of translating them into data then of encoding said data under the control of FIG. form of an MS service message to a cluster head or head capable of providing the determined service. This head recognizes said MS service messages and then implements the determined service S. For example, such a service may consist of aggregating the data transmitted to the head from several members via MS messages, and then implementing a long-distance transmission of said messages. aggregated or even consolidated data in the form of messages MC to a remote entity RS. Conventionally, an MS service message, addressed from a member of a cluster to a head, is structured to include information characterizing the type of the message (MS, MH, MR, etc.), an identifier from the source node, moreover generally a member, an identifier of the destination node, in this case a head, or even an identifier of an intermediate node in the case of a multiswitch network, data, for example in relation to measured quantities by a sensor of the device, possibly a redundancy code or even a cryptogram or any other control information allowing a receiving node to decode such a service message, to exploit or relay it. An MS message, like any other message circulating within the network, can trigger MACK acknowledgment messages, transmitted by the recipient of the message to the source node. At the extension of a given period or "timeout" according to English terminology, if no MACK message is received, a new transmission of the message MS is triggered, and this, for a limited number of iterations, to after which, the source node considers that the "route" or communication with the recipient is not available. Such a source node may decide to abandon the cluster and regain a free or loose node status. The adhesion of a free or loose node to a node acting as a cluster head or head is close to that implemented according to the LEACH solution. However, the methods of electing a head of cluster or head and the terms of membership of a free or loose node to become a member of a cluster or member, are very different. Unlike the state of the art, the election of a communicating electronic device does not arise from a hazard. On the contrary, according to the invention, only nodes in actual capacity to provide a specific service are able to self-designate heads. For their part, the other nodes are free to referee a competition of heads and to choose the head which appears the best candidate to implement the service to which they contribute.
[0019] FIG. 3 illustrates a method P100 of communication implemented by a device according to the invention, such as by way of example a device 10 described in connection with FIG. 2. Let us first describe, the treatment 110 set implemented by a communicating electronic device 10 according to the invention, implementing a method P100. The latter comprises a step of evaluation 111 of the capacity of the device 10 to provide a specific service S to possibly self-designate or self-elect head of a cluster or head. Such a step 111 may initially consist in estimating, at 1111, one or more operating parameters of the device 10 for testing the ability of the device 10 to correctly perform said service. As a preferred example, suppose that said service consists in aggregating data collected and deduced from MS service messages, consolidating said data, encoding an MC message and transmitting it by long distance communication means 16 to a remote server whose mission is to draw containers cooperating with communicating devices. To provide this service, the device must obviously include suitable communication means, such as the means 16. Moreover, such a communication for example GPRS type, mobilizes a large amount of electrical energy even if only to initiate the link. It is therefore imperative that a device, acting as a cluster head, has a sufficient energy reserve to support such a solicitation. Furthermore, it is also preferable that the transmission power of a GPRS signal is most optimal. Indeed, a low transmission power would cause slowness, therefore an increased emission time and particularly consuming electrical energy, even new attempts to issue successively in case of failure or pure and simple loss of messages MC . According to a first embodiment, the invention provides that step 1111 may consist of a self-test or self-evaluation step of the device, for example, of the battery level 17. The processing unit 11 may in addition, for example, testing the transmission power of a signal GPRS. Said processing unit may further examine in 1111 other functional parameters of the device, for example, the number of MC message transmissions. For example, a message sending counter MC may be implemented by the processing unit 11, a counter whose value can be stored in the memory 12. The estimate of the load on the device 10 as a head can it consists in the reading of said counter in memory 12. The method P100 advantageously causes the processing unit of the device 10 to carry out a step 112 to compare the estimated functional parameters with predetermined minimum functions.
[0020] Beforehand, a datum CH is produced at 1112, reflecting the capacity of said device 10 to be able to provide the determined service S. By way of example, the production of such a datum CH by the processing unit may consist of the evaluation of a predefined equation or function producing a metric integrating said estimated parameters, possibly weighted respectively to favor one parameter with respect to another. For example, a transmission power estimate GPRS may consist of calculating a ratio corresponding to the estimated transmission power of a test signal, divided by a constant describing a typical maximum power, i.e., under optimal conditions of emission. In connection with the battery level or more generally of the energy source 17 of the device, step 1112 can force the processing unit to calculate a ratio corresponding to the available energy estimated with respect to the energy at full load. More generally, such a metric CH characterizing the ability of a device to act as a cluster head can be calculated, in a nonlimiting manner, by evaluating an equation such that: CH = Ki.fl (p1 ) + K2.f2 (P2) - Ki.fi (Pi) for which K1, K2, ..., Ki constitute weights, possibly distinct, f (), f2 (), -, fi () are possibly distinct calculation functions, for example the elaboration of a ratio and pi, p2,..., pi are functional parameters of the device, of which, by way of nonlimiting example, the level of electrical energy of the source 17, a long distance transmit power, the size of a memory available for recording data, computing power, etc. The data CH can thus be related to a real value. It can also be composite, that is to say, be a structured data, comprising each functional parameter of the device or comprising, in place of one of said functional parameters, a determined function of one of said functional parameters. . Since a data item CH is produced at 1112, a method according to the invention advantageously comprises a step 112 for comparing said data item CH, which reflects the ability of the device to provide a specific service, at a minimum functional requirement threshold. In the case where the data CH is structured, it is the same for said threshold. The comparison 112 would then consist of as many independent comparisons of a functional parameter with particular minimum functional thresholds of requirement, to which a combinatorial logic (of type ET, OR, etc.) would be applied. If step 112 demonstrates that the data CH is greater than or equal to the minimum functional requirement threshold (link referenced 112-y in FIG. 3), the method P100 advantageously comprises a step 113 for encoding and transmitting an enrollment message MH . Such an MH message comprises the identifier of the device, which we refer to IDH, as an identifier of a device elected to act as a head, as well as the data CH translating the capacity of said device to be able to provide the determined service S This message MH may comprise a datum characterizing said service S. The message MH produced at 113 is broadcast (for example "broadcasted") by the first communication means 13 of said device under the action of the processing unit implementing said process. Any communicating device located within communication range, such as the device 10i described in FIG. 2, can receive said message MH.
[0021] Step 111 for estimating the ability to provide a given service may be performed iteratively, for example, according to predetermined time periods or any other triggering event. Such an event may for example consist in reaching a predetermined number of messages messages MC. The duration of such an evaluation period will be determined judiciously according to, in particular, the number of nodes composing the network. Indeed, a period too large increases the risk that devices acting as heads, remain so while they are no longer able to provide service effectively. A period that is too small increases, although the network's ability to exploit efficient heads, but implies a large number of transmissions and receptions of enlistment messages as well as numerous constitutions and destructions of clusters, thus reducing the overall energy capacity. said network. At the end of the production in 1112 of the data CH, if the functional minima at 112 are satisfied, a new enrollment message MH is issued. We will see later, how a device according to the invention exploits the reception of such an enrollment message MH, in particular to adhere to a cluster or remain a member of such a cluster.
[0022] The invention further provides that if, on the other hand, the comparison 112 attests that the functional parameters of a device do not meet the minimum functional requirements at 112, there is no transmission of an enrollment message. Thus, any electronic device according to the invention which is not able to provide a given service, even if it theoretically has the hardware or software means to achieve it, can not be elected head of cluster and constitute a cluster of communicating devices.
[0023] The invention further provides that the method P100 may comprise a step 114, optionally attached to the step 112, to compare the CH data produced in 1112, to a minimum functional, attesting to an insufficient capacity to provide service. Such a minimum threshold may be predetermined and recorded, like the threshold operated in step 112, in the memory 12. This step 114 and a fortiori a step 115 that may result, may be advantageously subsequent to the issue 113 of an enrollment message MH. If the comparison 114 confirms (link 114-y in FIG. 3) that the device is no longer capable of providing the service S, the method P100 according to the invention may advantageously comprise a step 115 for encoding and transmitting a destruction message. MR cluster, advantageously broadcasted. This transmission of a message MR can be carried out by the communication means 13 of the device, under the impetus of the processing unit 11 implementing the method P100. Like an MH enrollment message, an MR cluster destruction message, sent from a device previously acting as a cluster head but no longer in a position to be able to efficiently provide a particular service S, comprises the identifier of said device, denoted IDR. It may also include the CH data characterizing the capacity, or in this case, an inability to provide the service. As a variant, such an MR message can simply associate the identifier of the transmitting device with information characterizing the message MR as a cluster destruction message. We will later see how is exploited the reception of such an MR message by one or more devices members of a cluster. This step 115 may advantageously be triggered only if the transmitting device previously acted as a head, so as not to unnecessarily send out irrelevant cluster destruction messages and also to prevent any undue exploitation of such messages by nodes. receivers. In order for a device according to the invention to detect that it was previously in a position to assume a role of head, the processing unit 11 of said device can for example operate a message transmission counter MC, such as As discussed previously, stored in memory 12. In comparison 114, a value of said counter, greater than its initial value, teaches that said device was acting as a cluster head. At the end of the transmission of an MR message, said counter can be reset to the initial value. However, any other action could be implemented by the processing unit 11 to validate the implementation of step 115, in place of the operation of the message transmission counter MC. By way of nonlimiting example, such an action can result from the reception, by the device acting as head, of an enrollment message emanating from a third device, also acting as a head and whose data reflecting his ability to provide the same service is superior to his own. In this case, the device triggers step 115, thus fading in front of better than it. According to this latter variant, the invention provides for limiting the number of MR cluster destruction message emissions, a direct consequence of a particularly dynamic and oscillating evolution of node capacities to act as heads, resulting in very sustained competition. between many heads. Such a situation can for example be encountered during a rail transport of a multitude of containers, each cooperating with a communicating device according to the invention and for which, the determined service is to regularly issue GPRS information related with the contents of the containers. The ability of heads to transmit long distance can be very changeable. To meet this difficulty, the invention provides for integrating into the implementation of step 114 a "competition factor", for example a positive real, greater than "1", the value of which can be recorded in FIGS. memories 12 of the different nodes. Thus, a head, receiving an enrollment message MH emanating from a third node, does not compare, in step 114, strictly CH data reflecting the respective capabilities to provide the same service. Step 114 consists in comparing the data CH deduced from the enrollment message MH multiplied by the competition factor. Thus, if said factor is greater than "1", for example "1.25", then the node, implementing step 114, is penalized by the exploitation of said factor with regard to the competitor. Thus, even if the data CH of said node reflects a better capacity than that of the head having sent the message MH, the application of the competition factor, virtually improves that of the competitor. In this case, the node implements step 115, transmits an MR cluster destruction message, and joins the competitor's cluster as a member. Such a solution makes it possible to limit too many cluster creations / destructions and reducing the network's energy capacity. It also makes it possible to limit the number of nodes able to act concomitantly as heads. Indeed, depending on the S service envisaged, for example with a long-distance transmission, too many nodes acting together as heads, draw, for example, too much in the energy reserves of the network. The competition factor can therefore be seen as a parameter for regulating the number of heads and the dynamics of the adaptability of the network to its environment. Let us now study the processing 100 carried out by the processing unit 11 of a device 10, during the implementation of a P100 adhesion process, in response to the receipt of an MH enrollment message. . A method P100 according to the invention thus comprises a first step 101 for receiving an MH enrollment message 25 produced and transmitted by a communicating electronic device, such as the node d2 or the node h3, described with reference to FIG. such enrollment message MH comprises the identifier IDH of the device transmitting said enrollment message. The method P100 further comprises a step 102 for decoding said enrollment message MH and for deriving said IDH identifier. It further comprises a step 103 for updating an HR record, arranged within the data memory 12, said record being provided for recording the value of the identifier IDH as the current value identifier IDHc of a device elected to act as a cluster head, for example the device d2 or the device h3 illustrated in FIGS. 1 and 2. The message MH thus decoded furthermore comprises a data item CH representing the capacity of said transmitter device to be able to ensure a given service S. Step 102 for decoding said enrollment message MH further deduces said data CH. According to the invention, during update 103 of the record RH, the value of the data CH translating the ability of the transmitting device to provide said service S, is also recorded in said record RH. The recorded value is noted CHc, to translate the current capacity of the head to provide the service. In a network, such as the network R2 described in connection with FIG. 1, that is to say a single-jump network, the device 10 that has just implemented such a method P100 becomes a member of the cluster whose the transmitter of the MH message acts as a cluster head. This is for example the case of the devices acting as member nodes of the cluster C2 described in connection with FIG. 1. Unlike nodes implementing, for example, LEACH technology, the members of a cluster conforming to FIG. The invention is certain that the node acting as a head is capable of assuming a given service. Storing the capacity of said head in the RH record enables it, upon receipt of a new MH message sent by another transmitting device, to possibly compare the capacity of the current head with that of a new candidate. We will study the case of the competition between 30 heads later, competition refereed by member nodes or free. The invention further provides that a node already member of a cluster and / or alternatively a free node can decide to adhere to the node having issued a message MH. Thus, according to a preferred variant, the step 103 of the adhesion process P100, to update the record RH can only be performed, if the data CH, representing the capacity of the node wishing to act as a head of cluster, is greater than or equal to a specified minimum threshold. The method P100 thus comprises a step 104 for comparing the data representing the capacity deduced at 102 from the message RH with the said minimum requirement threshold. Thus, a cluster candidate node may be more demanding or selective than the minimum election criteria for a head.
[0024] Said minimum requirement threshold exploited by the candidate node may be of a structure similar to that of the threshold exploited by the head during its self-election. Said minimum requirement threshold is advantageously recorded in the data memory 12, or even constitutes a predefined constant and fixed in the program memory 14. It can be advantageously identical for all the nodes. As mentioned above, MH enrollment messages may be regularly transmitted by one or more communicating devices located within radio communication range, such as the device 10i described in connection with Figure 2. A device 10, acting as a member of a cluster, can therefore be in the situation of receiving and decoding an enrollment message MH while said device 10 is already attached to a head. Two cases arise. In a first situation, the device 10 has already exploited an enrollment message MH issued by the same device acting as a head. The value of identifier IDH of the latter is therefore identical to that IDHc stored in the record RH, said record being arranged in the data memory 12 of the device 10. According to a second situation, the value of the identifier IDH deduced from the MH message is distinct from the IDHc value. The member device is in a position to arbitrate a competition between two third party devices able to assume the same service. The method P100 comprises a step 105 subsequent to the step of decoding 102 an enrollment message MH and prior to the step of updating the record 103 RH comprising the current value IDHc of the identifier of the device acting as than cluster head. This step 105 advantageously consists in reading in 1051, within said RH record, said current value IDHc. Then step 105 consists in comparing at 1052 said current value IDHc to that IDH of the identifier of the device transmitting the enrollment message MH decoded at 102. In the case of the first situation, mentioned above, said values IDHc and IDH are identical (situation symbolized by the link 1052-y in Figure 3). The HR record can thus be updated in step 103. This action makes it possible, in particular, to update the data CH within the HR record. Indeed, according to the evolution of the operating context of the head, the capacity of the latter to provide the service, may have evolved. It may have deteriorated, for example because of a lower energy reserve. It may have improved, because of the disappearance of an obstacle which penalized the power of emission of a signal by way GPRS. On the other hand, in the case where the IDH and IDHc values are distinct (situation symbolized by the link 1052-n described in FIG. 3), a device able to act as a head competes with the one that is member 10's eyes, currently the device acting as a cluster head. The invention provides that step 105 may comprise a step 1053 for comparing the data CH representing the capacity of the device transmitting the enrollment message MH to the data CHc stored in the record RH and reflecting the ability to assume the same service. S by the device currently acting as a cluster head. According to a first embodiment, if the value of the data CH deduced from the new enrollment message is greater than the value CHc (situation symbolized by the link 1053-y), then step 103 is performed to update the HR registration. The value IDHc takes the value of the identifier of the issuer of the enrollment message. The device 10 thus leaves the preceding cluster to adhere to that for which the device transmitting the message MH acts as a head. The service messages developed by the device 10 will now be sent to the new head. In the opposite situation, if the value of the data CH deduced from the new enrollment message is less than or equal to the value CHc (situation symbolized by the link 1053-n), then step 103 is not completed because the issuer of the enrollment message is less efficient than the current cluster head.
[0025] The invention provides a second embodiment to limit too frequent changes of heads. Indeed, as we will see later, especially in the implementation of a multisauts network according to the invention, a head change can cause the emission of many messages within the network and impair the overall energy capacity of the network . To limit the number of inadvertent membership changes, especially if the data CH and CHc, reflecting the respective capacities to assume the same service, are very close, the invention provides for privileging a certain "fidelity", although very relative , for the benefit of the device currently acting as a cluster head, even though the latter is proving to be less efficient than the device entering into competition.
[0026] Thus, if the IDH and IDHc identifier values are distinct (situation symbolized by the link 1052-n), then the step 103 to update the HR record is only performed if (situation symbolized by the link 1053 -y in Figure 3) a significant difference, equal to a predetermined non-zero constant, exists in favor of the device transmitting the enrollment message. The step 1053 can therefore be adapted so that the update 103 of the record RH is performed only if the data CH translating the capacity of the device transmitting the enrollment message MH is greater than or equal to that stored in the HR record increased by said gap. As a variant or in addition, in the context of a multislot network, step 1053 may furthermore integrate the exploitation of a DST information, translating on the one hand a distance in number of jumps between the member and the head applicant and a distance separating said member from the current node acting as a cluster head. Such DST information may be encoded in an MH message broadcast in a multiswitch network as will be discussed below. In this case, step 102 is adapted to deduce from the message MH said DST information. The same is true for step 103 in order to register in the HR record in conjunction with the data item CH, the DST information. The step 1053 can implement any function exploiting, possibly weighted, the data CH and the information DST. Thus, a head, whose data CH is less favorable than that of a second head competing with the first, may be preferred if it is closer (in number of jumps) than said second. The number of service messages, for example, will be reduced. The DST information thus regulates the size of the clusters within a multi-tasking network. The invention makes it possible to operate a single hop network or a multisize network such as the network R1 described above in connection with FIG. 1. According to such a network, it is necessary to be able to relay an MH enrollment message over beyond the transmission range of the self-elected device, able to act as a cluster head. The goal is that such an HD message can be exploited by a free device or member of a possible separate cluster, to create clusters with an increased number of members compared to a cluster within a network single-hop, for a similar short-range broadcast range. The invention thus provides that a method of adhesion P100 may comprise a step 106, subsequent to step 103, for updating the record RH of the device implementing said method P100. This additional step 106 consists of encoding and transmitting, via the communication means 13, an enrollment message MH comprising the identifier of the device registered in the record RH, the latter comprising the current value IDHc of the identifier of the device acting as a cluster head, the data CHc representing the ability of said device to be able to provide a particular service, as well as the identifier of the device acting as a relaying group member of the enrollment message MH emanating from the device acting as a cluster head. As mentioned above, the invention provides that said relayed MH message may include a DST information translating the distance, in number of hops, separating the relay node of the head having sent the enrollment message MH. Thus, by way of non-limiting example, if the message MH is relayed once, the information DST is "2". If the message is relayed 3 times, the DST information takes the value "4". According to this variant, the adhesion method P100 according to the invention may advantageously be adapted so that the step 102 for decoding an enrollment message RH furthermore consists in deducing from said decoded message the value of the identifier of a device acting as a member relaying cluster of an enrollment message MH and possibly the information DST, if it exists. Step 103 to update the HR record arranged in the memory 12 of the device having received the relayed enrollment message, furthermore consists in writing within said record, said identifier of the relay member of the message relay member. enrollment, or even distance information DST. The pair of identifiers of the cluster members and cluster head devices thus constitutes road information entered in the HR record. This route information can be exploited to issue MS service messages to the head. Indeed, an adhesion method according to the invention may comprise a step 123 for sending an MS service message to the device acting as a cluster head or head for a given service S. Such a step 123 is part of a processing 120 undertaken to contribute to said service S. The step 123 is implemented following a preliminary step to, for example, collect from a sensor 15 a measurement related to the temperature prevailing within a container, against which the device 10 implementing the P100 process is affixed. Of course, such a step 123 is also conditioned on the presence (step 122 in FIG. 3) of an RH register comprising the IDHc value of an identifier of a device or node acting as a cluster head (symbolized situation by the link 122y in Figure 3). According to whether said record has a direct route, i.e., only a head identifier value is present in the HR record, or an indirect route, i.e. In addition, the record includes an identifier value of a relay member, the message MS is directly transmitted to said head or to said relay member. Furthermore, such a transmission 123 of an MS service message can also be triggered by the reception 121 of a service message MS emanating from a member of the same cluster and addressed to the device 10, which implements said adhesion process P100 and acts as a relay member. Following receipt of such a service message from a member of the same cluster, step 121 may therefore include a step for receiving and decoding such an MS message, or even temporarily storing in the memory 12, the data contained in said decoded MS service message. The relay of said MS message can thus be translated into a delayed retransmission. Let us now study a method of adhesion P100 according to the invention and comprising a processing 130 for exploiting a message MR of destruction of cluster as evoked previously. Such a treatment 130 of a P100 adhesion process in accordance with the invention comprises a first step 131 for receiving an MR 20 cluster destruction message produced and transmitted by a third communicating electronic device, for example the device 10i, having received previously quality to act as a cluster head. As previously discussed in connection with steps 114 and 115, an MR cluster destruction message 25 includes the IDR ID of the device having issued said MR cluster destruction message. The process 130 further comprises a step 132 for decoding said cluster destruction message and deriving the value of said IDR from the device sending the cluster destruction message. The reception of such an MR message by a device acting as a member of the cluster concerned by the destruction message means a strict instruction to abandon the cluster, said member covering a free or loose node status. For this, the method P100 advantageously comprises a step 133 for updating the record RH comprising the current value IDHc of the identifier of a device acting as a cluster head, to delete said current value or to replace it. ci by a predetermined value reflecting a lack of device identifier acting as a cluster head. Of course, said update 133 of the HR record is performed only if (situation symbolized by the link 134-y in conjunction with Figure 3) the value of the identifier IDR deduced from the message of destruction of cluster MR is identical to the current value IDHc written in said HR record. The method P100 thus comprises a step 134, prior to step 133, for implementing said comparison of values of identifiers IDR and IDHc.
[0027] In the context of the operation of a multislot network, like an MH enrollment message, an MR cluster destruction message can be advantageously relayed by a member becoming free by the implementation of the step 133, by triggering the transmission of such a MR message and relayed to other potential members of the cluster being destroyed. Whatever the configuration of a cluster adhesion process P100, said method being in accordance with the invention, a preferred mode of adaptation of a communicating electronic device, such as that described with reference to FIG. consists in recording or downloading in the program memory 14, a computer program P, comprising a plurality of program instructions which, when they are executed or interpreted by the processing unit of said device, cause the implementation of said P100 process.
[0028] The invention has been described through an example of a preferred application in connection with the tracking of containers of goods, solid, fluid or liquid goods, said containers cooperating respectively with communicating electronic devices, such as devices 10 and 10i according to FIG. 2, implementing an adhesion process, such as the method P100 illustrated in FIG. 3, said devices each comprising a sensor cooperating with a processing unit for measuring and collecting a quantity in connection with the internal environments and or external of said containers.
[0029] Such devices could be exploited for any other application different from that for transmitting data collected over a long distance link. They could also, alternatively or in addition, provide one or more other services. For this, as mentioned above, the data memory 12 of each device may comprise, not a single HR record dedicated to a particular service S, but a plurality of records RHn, forming a table, each record being dedicated to a particular service Sn. The MH enrollment, MS service, or even MR cluster destruction messages, include, according to this variant, information to identify the Sn service determined and concerned by each of said messages.
[0030] Furthermore, the invention thus relates to any system comprising a plurality of communicating electronic devices according to the invention. More particularly, the invention relates to any container traceability system on a storage area or a transport platform, said system further comprising a remote entity for collecting and operating MC messages transmitted from one or more of said devices when they act. as a cluster head. Such a system has performance in terms of energy autonomy, robustness and adaptability to operating conditions unmatched and unparalleled compared to those conferred by known solutions, such as, for example, the LEACH process. Indeed, thanks to the invention, the exploitation of cluster heads, since their elections, until the achievement of the action or actions concerned by a specific service, is optimal, preventing any superfluous or inefficient communication within the network or to third parties.10

权利要求:
Claims (15)
[0001]
REVENDICATIONS1. Method of adhesion (P100) to a cluster comprising a plurality of communicating electronic devices (10, 10i, al, ..., a8, bl, ..., b8 j1, ..., j5), said method being set implemented by a processing unit (11) of one of said communicating electronic devices or of a foreign communicating electronic device (10) to said cluster (C1, C2), said electronic device comprising in addition to said processing unit (11) a data memory (12), first communication means (13) providing wireless proximity communication with any other electronic device (10i) within communication range, said memory (12) and said communication means (13). ) cooperating with said processing unit (11), the data memory (12) having the value of an identifier (ID) dedicated to the communicating electronic device (10) and a record (RH) to include the current value of a identifier of an electronic device communicator (d2, h3) acting as a cluster head, said method (P100) comprising: - a step (101) for receiving an enrollment message (MH) prepared and transmitted by a third-party communicating electronic device (d2, h3 ) having quality to act as a cluster head, said enrollment message (MH) comprising the identifier of the device (d2, h3) transmitting said enrollment message (MH); - a step (102) for decoding said enrollment message (MH) and to deduce said identifier (IDH) of said device transmitting the enrollment message (d2, h3); a step (103) for updating the record (RH) so that said record stores as a current identifier value (IDHc) of device (d2, h3) acting as a cluster head the value of the identifier (IDH) of the device transmitting the decoded enrollment message (MH), said device implementing said method becoming a cluster member; said method (P100) being characterized in that: - said enrollment message (MH) further comprises data (CH) reflecting the ability of said transmitter device to be able to provide a given service (S); the step of decoding (102) said enrollment message (MH) furthermore deduces from said message said datum (CH) expressing said capacity; the step of updating (103) the recording (RH) furthermore consists in writing in said record (RH) the value (CHc) of the data item (CH) representing the ability of the transmitting device to provide said service ( S).
[0002]
2. Method (P100) according to the preceding claim, wherein the step (103) for updating the record (RH) is only performed if (104) the data (CH) representing said capacity is greater than or equal to at a minimum threshold of specified requirement.
[0003]
3. Method (P100) according to claims 1 or 2, comprising a step (105) subsequent to the step for decoding (102) an enrollment message (MH) and prior to the step to update (103) the record (RH) comprising the current value of the identifier (IDHc) of the device acting as a cluster head, said step (105) consisting of: - reading (1051) within said record (RH) the current value (IDHc) of the identifier of the device acting at the head of the cluster; comparing (1052) said current value (IDHc) with that (IDH) of the identifier of the device transmitting the decoded enrollment message (MH); and for which, if (1052-n) said identifier values (IDHC, IDH) are distinct, the step of updating (103) the record (RH) is performed only if (1053-y) the data (CH) representing the capacity of the device transmitting the enrollment message (MH) to provide the same service (S) is greater than or equal to (1053) the value of the data item (CHc) representing the current capacity of the device ( d2, h3) acting as a cluster head increased by a determined non-zero constant.
[0004]
A method (P100) according to any one of the preceding claims, comprising a step subsequent to the step (103) for updating the record (RH), for encoding and transmitting (106) via the communication means (13). ) an enrollment message (MH) comprising the identifier of the device entered in the record comprising the current value (IDHc) of the identifier of the device acting as a cluster head, the data item (CHc) representing the capacity of said device device capable of performing the service, as well as the identifier (ID) of the device (10) implementing said method of adhesion (P100) and acting as a relaying group member of the enrollment message (MH) originating from the device acting as a cluster head.
[0005]
Method (P100) according to the preceding claim, in which the step of decoding (102) an enrollment message (MH) consists in deducing from said decoded message the value of the identifier (IDH) of a device acting as a as a cluster member and relaying an enrollment message (MH) from a device acting as a cluster head, and for which the step of updating (103) the record (RH) consists of in addition to registering within said registration said identifier of the cluster member member, relayer of the enrollment message, the pair of identifiers of the cluster member devices and cluster head thus constituting a route information.
[0006]
6. Method (P100) according to any one of the preceding claims, comprisinga stepfor issuing (123) a service message (MS) to the device acting as a cluster head for the service (S) in question.
[0007]
A method as claimed in any one of the preceding claims, comprising: - a step (131) for receiving a cluster destruction message (MR) prepared and issued by a third party communicating electronic device having prior quality to act as a cluster head said cluster destruction message (MR) comprising the identifier (IDR) of the device transmitting said cluster destruction message; a step for decoding (132) said cluster destruction message (MR) and for deriving said identifier (IDR) from said device transmitting the cluster destruction message; a step for updating (133) the record (RH) comprising the current value (IDHc) of an identifier of a device acting as a cluster head, for deleting said current value or replacing it with a predetermined value representing a lack of a device identifier acting as a cluster head, said device implementing said method becoming free, said updating (133) of the recording (RH) being performed only if ( 134-y) the value of the identifier deduced from the cluster destruction message is identical to the current value entered in said record.
[0008]
8. Method according to any one of the preceding claims, comprising: - a step for evaluating (111) the capacity of the device (10), implementing said method (P100), to assume a service (S) determined, said step (111) estimating (1111) one or more operating parameters of said device (10) and producing (1112) the data (CH) representing the ability of said device (10) to be able to provide the determined service (S), - a step of comparing (112) the data translating said capacity to a minimum functional requirement threshold; a step for encoding and transmitting (113) an enrollment message (MH), comprising the identifier (IDH) of said device as well as the data item (CH) representing the capacity of said device to be able to provide said determined service (S), to any communicating device (10i) located within communication range, said step (113) being implemented only if (112-y) the data translating said capacity is greater than or equal to said minimum functional requirement threshold.
[0009]
9. Method (P100) according to the preceding claim, wherein the step for evaluating the capacity (111) of the device (10) implementing said method to assume a particular service (S) is iterative, said method comprising a step subsequent to transmitting (113) an enrollment message (MH), for encoding and transmitting (115) a cluster destruction message (MR), said message (MR) including the identifier of said device, destined for any communicating device (10i) located within communication range, as soon as an occurrence of the step (111) for evaluating the capacity of the device to assume the determined service (S) attests that a parameter among the operating parameters of said device, is (114) less than a required functional minimum, indicating insufficient capacity to perform the service.
[0010]
10. The method of claim 8 or 9, wherein the device comprises a source of electrical energy (17) supplying the processing unit, the data memory, the communication means, and for which one of said operating parameters. describes the level of electrical energy available from the source of electrical energy (17).
[0011]
11. Method according to any one of claims 8 to 10, wherein the device comprises second means (16) for long distance communication cooperating with the processing unit, the service of transmitting data to a remote entity (RS ) via said long distance communication means (16), and for which, one of said operating parametersdescribes the transmission power of a signal by the long distance communication means (16).
[0012]
Computer program (P) comprising a plurality of program instructions which, when they are: - previously stored in a program memory (14) of an electronic device (10) further comprising a processing unit ( 11), first communication means (13) providing wireless proximity communication with any other electronic device (10i) within communication range, a data memory (12) recording the value of a dedicated identifier (ID) to the device and a record (RH) for comprising the current value of an identifier of a device acting as a cluster head, said memories (12, 14) and communication means (13) cooperating with said processing unit ( 11); - executed or interpreted by said processing unit (11), causes the implementation of a method according to claims 1 or 9.
[0013]
13. Computer program according to the preceding claim, wherein the device (10) implementing said method comprises a source of electrical energy (17) supplying the processing unit (11), the data memory (12), the program memory (14), the first communication means (13), and for which the instructions, when executed or interpreted by the processing unit of the device, cause the implementation of a method according to the claim 10.
[0014]
14. Computer program according to claim 12 or 13, for which the device implementing said method comprises second long-distance communication means (16) cooperating with the processing unit (11), and for which the instructions, when executed or interpreted by the processing unit of the device, cause the implementation of a method according to claim 11.
[0015]
An electronic device (10) comprising a processing unit (11), a data memory (12), a program memory (14), first communication means (13) providing wireless proximity communication with any other electronic device (10i) located in communication range, said memories (12, 14) and communication means (13) cooperating with said processing unit (11), the data memory (12) having the value of an identifier ( ID) dedicated to the device and a record (RH) to include the current value of an identifier of a device acting as a cluster head, said device (10) being characterized in that it comprises in the program memory (14), the instructions of a program (P) according to claim 12.16. Electronic device (10) according to the preceding claim comprising a source of electrical energy (17) supplying the processing unit (11), said device being characterized in that it comprises in the program memory (14), the instructions for A program (P) according to claim 13. 17. An electronic device (10) according to claim 15 or 16 including second long-distance communication means (16) cooperating with the processing unit (11), said device (10) ) being characterized in that it comprises in the program memory (14) the instructions of a program (P) according to claim 14. 18. A system comprising a plurality of communicating electronic devices (10, 10i) in accordance with the 19. The system according to the preceding claim comprising a plurality of containers of goods, solid goods, fluids or liquids, said containers respectively cooperating with each other. with the communicating electronic devices (10, 10i), the latter each comprising a sensor (15) cooperating with the processing unit (11) for measuring and collecting a quantity related to the internal and / or external environments of said containers.

类似技术:

---

公开号 | 公开日 | 专利标题

---

EP3167631B1|2019-12-18|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system

---

EP3225052B1|2018-11-07|Method for affiliating a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system

---

CA2815448C|2019-01-15|Method and system for transmitting and receiving data coming from an aircraft black box

---

EP3275217B1|2019-01-02|Communication method within a dynamic-depth cluster of communicating electronic devices, communicating electronic device implementing said method and associated system

---

FR2988244A1|2013-09-20|METHOD AND SYSTEM FOR DATA TRANSMISSION IN AN AIRCRAFT NETWORK IN FLIGHT

---

WO2007065987A1|2007-06-14|Method for rebuilding an ad hoc network and the nodes thereof

---

FR2883440A1|2006-09-22|METHOD AND EQUIPMENT FOR DATA TRANSMISSION BY AD HOC NETWORK

---

CN102387062B|2014-04-23|Method for improving transmission rate of peer-to-peer | node in crossing network by dynamic bridging contact

---

WO2010119230A1|2010-10-21|System and method for locating a target using a transceiver array

---

EP3675435A1|2020-07-01|Method for dynamic routing in a network of connected objects

---

WO2020016499A1|2020-01-23|Method for coordinating a plurality of device management servers

---

EP3891959A1|2021-10-13|Gateway for communicating via radio network with at least one node and via a wired network, by means of a blockchain

---

FR2915044A1|2008-10-17|Overlay network`s i.e. peer to peer network, dynamic range determining method, involves determining local dynamic range corresponding to sum of parts of obtained information in corresponding communication node of network

---

FR3017017A1|2015-07-31|COMMUNICATION METHOD BETWEEN A BATTERY POWERED TERMINAL AND A BASE STATION AND COMMUNICATION NETWORK THEREOF

---

EP3211841B1|2019-06-26|Method for deciding to relay a copy of a route discovery request in a communication network by broadcast

---

EP3825919A1|2021-05-26|Method for association of user equipment in a cellular network by means of multi-agent reinforcement learning

---

EP3900386A1|2021-10-27|Method for managing a data communication device and device for implementing the method

---

FR2980939A1|2013-04-05|MULTI-SKIP ROUTING PROTOCOL

---

EP2273727A1|2011-01-12|Method for obtainingservice availability information in a communication network, apparatus and corresponding computer program

---

EP2202942B1|2018-02-07|Group monitoring method

---

FR3096850A1|2020-12-04|PROCESS FOR TRANSMISSION OF DATA BETWEEN A TRANSMITTER AND A RECEIVER IN A RADIOCOMMUNICATIONS NETWORK WITH LOCAL LOOP CAPACITY

---

WO2011023904A1|2011-03-03|Method for the geolocated broadcasting of content in a telecommunication network

---

FR3081665A1|2019-11-29|METHOD FOR EVALUATING THE ENERGY CONSUMPTION OF A SERVICE TRANCHE IN A COMMUNICATIONS NETWORK

---

FR3066342A1|2018-11-16|SINGULARIZATION OF FRAMES TO BE EMITTED BY A CONNECTED OBJECT AND BLOCKING OF REWARDED FRAMES ON A LOW CONSUMPTION WIRELESS COMMUNICATION NETWORK

---

WO2012131280A1|2012-10-04|Data communication in a sensor array

同族专利:

---

公开号 | 公开日

---

AU2015287459A2|2017-06-01|

---

BR112017000560A2|2018-03-13|

---

CN107005785B|2021-06-01|

---

FR3023662B1|2017-10-20|

---

RU2017104241A3|2019-02-08|

---

MX371399B|2020-01-29|

---

US9756551B2|2017-09-05|

---

JP2017529027A|2017-09-28|

---

KR20170031737A|2017-03-21|

---

ZA201700166B|2018-04-25|

---

AU2015287459B2|2019-08-29|

---

EP3167631B1|2019-12-18|

---

KR102035107B1|2019-10-22|

---

CN107005785A|2017-08-01|

---

MX2017000347A|2017-08-25|

---

MA40216A|2017-05-17|

---

RU2017104241A|2018-08-15|

---

US20170127337A1|2017-05-04|

---

CA2954700A1|2016-01-14|

---

EP3167631A1|2017-05-17|

---

DK3167631T3|2020-03-23|

---

WO2016005675A1|2016-01-14|

---

JP6484710B2|2019-03-13|

---

AU2015287459A1|2017-02-02|

---

SG11201700082WA|2017-02-27|

---

RU2697388C2|2019-08-14|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

US7203729B2|2001-04-20|2007-04-10|Motorola Inc.|Method and apparatus for a communication network with nodes capable of selective cluster head operation|

---

US20030151513A1|2002-01-10|2003-08-14|Falk Herrmann|Self-organizing hierarchical wireless network for surveillance and control|

---

RU61442U1|2006-03-16|2007-02-27|Открытое акционерное общество "Банк патентованных идей" /Patented Ideas Bank,Ink./|SYSTEM OF AUTOMATED ORDERING OF UNSTRUCTURED INFORMATION FLOW OF INPUT DATA|

---

CN101188444B|2007-05-25|2012-04-04|中国科学院嘉兴无线传感网工程中心|A method for distributed section networking in wireless sensing network|

---

EP2606577A1|2010-10-01|2013-06-26|NEC Europe Ltd.|Method for colaborative energy transfer in a wireless network and corresponding wireless network|

---

CN102711180B|2012-05-25|2014-11-05|杭州电子科技大学|Cluster head multiple selection energy balance routing method|

---

US10061620B2|2012-07-02|2018-08-28|Paypal, Inc.|System and method for clustering of mobile devices and applications|

---

US9390055B2|2012-07-17|2016-07-12|Coho Data, Inc.|Systems, methods and devices for integrating end-host and network resources in distributed memory|

---

US9225606B2|2013-04-03|2015-12-29|Mitsubishi Electric Research Laboratories, Inc.|Method for clustering devices in machine-to-machine networks to minimize collisions|

---

CN103298032B|2013-07-02|2016-02-03|重庆大学|Node energy consumption equalization methods in a kind of wireless sensor network|

---

WO2016161171A1|2015-03-31|2016-10-06|Avigilon Corporation|Security device capability discovery and device selection|US20150254415A1|2014-03-04|2015-09-10|Cerner Innovation, Inc.|Methods and Systems for Context Driven Real Time Messaging in Healthcare Information|

---

US10506663B2|2016-06-28|2019-12-10|Telefonaktiebolaget Lm Ericsson |Method and device for determining cluster-heads|

---

DK3336782T3|2016-12-13|2020-06-02|Traxens|METHOD OF GEOGRAPHICAL BASED SELECTION OF RADIO FREQUENCY TAPES|

---

US20180183857A1|2016-12-23|2018-06-28|Intel Corporation|Collective communication operation|

---

EP3632085A1|2017-05-22|2020-04-08|Sony Mobile Communications Inc.|Method of clustering transportation units, transportation unit and computer program|

---

WO2019034307A1|2017-08-14|2019-02-21|Sas Inferency|Door to door multimodal track and trace device|

---

US10631245B2|2017-09-26|2020-04-21|King Fahd University Of Petroleum And Minerals|Node placement for pipeline monitoring|

法律状态:
2015-07-20| PLFP| Fee payment|Year of fee payment: 2 |

---

2016-01-15| PLSC| Search report ready|Effective date: 20160115 |

---

2016-07-21| PLFP| Fee payment|Year of fee payment: 3 |

---

2017-07-21| CA| Change of address|Effective date: 20170616 |

---

2017-07-24| PLFP| Fee payment|Year of fee payment: 4 |

---

2017-11-10| RM| Correction of a material error|Effective date: 20171005 |

---

2018-07-25| PLFP| Fee payment|Year of fee payment: 5 |

---

2019-07-19| PLFP| Fee payment|Year of fee payment: 6 |

---

2020-02-28| CJ| Change in legal form|Effective date: 20200121 |

---

2020-02-28| CA| Change of address|Effective date: 20200121 |

---

2020-04-03| CL| Concession to grant licences|Name of requester: TRAXENS, FR Effective date: 20200221 |

---

2020-07-31| PLFP| Fee payment|Year of fee payment: 7 |

---

2021-07-29| PLFP| Fee payment|Year of fee payment: 8 |

优先权:

---

申请号 | 申请日 | 专利标题

---

FR1456660A|FR3023662B1|2014-07-10|2014-07-10|METHOD OF ADHESION TO A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECTRONIC DEVICE USING THE SAME, AND SYSTEM THEREFOR|FR1456660A| FR3023662B1|2014-07-10|2014-07-10|METHOD OF ADHESION TO A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING VIA A WIRELESS NETWORK, ELECTRONIC DEVICE USING THE SAME, AND SYSTEM THEREFOR|

---

KR1020177003838A| KR102035107B1|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

PCT/FR2015/051776| WO2016005675A1|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

MA040216A| MA40216A|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

JP2017521617A| JP6484710B2|2014-07-10|2015-06-29|Method of joining a communication electronic device over a wireless network to a cluster, electronic device performing the method, and related system|

---

RU2017104241A| RU2697388C2|2014-07-10|2015-06-29|Method of connecting to a cluster of electronic devices communicating via a wireless network, a corresponding system and an electronic device which performs said method|

---

BR112017000560-3A| BR112017000560A2|2014-07-10|2015-06-29|method for joining a grouping of electronic communication devices over a wireless network, associated system and electronic device that implements said method|

---

CA2954700A| CA2954700A1|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

AU2015287459A| AU2015287459B2|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

EP15759836.8A| EP3167631B1|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

DK15759836.8T| DK3167631T3|2014-07-10|2015-06-29|PROCEDURE FOR CONNECTING A CLUSTER OF ELECTRONIC DEVICES COMMUNICATING THROUGH A WIRELESS NETWORK RELATING TO THE ELECTRONIC REQUEST EXECUTING THE PROCEDURE AND SYSTEM|

---

SG11201700082WA| SG11201700082WA|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|

---

MX2017000347A| MX371399B|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system.|

---

CN201580048720.8A| CN107005785B|2014-07-10|2015-06-29|Method for joining a cluster of electronic devices communicating via a wireless network, electronic device implementing said method and associated system|

---

US15/401,715| US9756551B2|2014-07-10|2017-01-09|Method for joining a cluster of communicating electronic devices via a wireless network, associated system and electronic device implementing said method|

---

ZA2017/00166A| ZA201700166B|2014-07-10|2017-01-09|Method for joining a cluster of electronic devices communicating via a wireless network, associated electronic device implementing said method and system|